Gaussian quantum computation with oracle-decision problems
نویسندگان
چکیده
منابع مشابه
Quantum Computation and Decision Trees
Many interesting computational problems can be reformulated in terms of decision trees. A natural classical algorithm is to then run a random walk on the tree, starting at the root, to see if the tree contains a node n levels from the root. We devise a quantum mechanical algorithm that evolves a state, initially localized at the root, through the tree. We prove that if the classical strategy su...
متن کاملQuantum-classical Correspondence in the Oracle Model of Computation
The oracle model of computation is believed to allow a rigorous proof of quantum over classical computational superiority. Since quantum and classical oracles are essentially different, a correspondence principle is commonly implicitly used as a platform for comparison of oracle complexity. Here, we question the grounds on which this correspondence is based. Obviously, results on quantum speed-...
متن کاملFault-tolerant quantum computation versus Gaussian noise
The theory of fault-tolerant quantum computation shows that properly encoded quantum information can be protected against decoherence and processed reliably with imperfect hardware 1 . Demonstrating that this theory really works in practice is one of the great challenges facing contemporary science. A large-scale fault-tolerant quantum computer would be a scientific milestone, and it should als...
متن کاملQuantum Computation and Lattice Problems
We present the first explicit connection between quantum computation and lattice problems. Namely, our main result is a solution to the Unique Shortest Vector Problem (SVP) under the assumption that there exists an algorithm that solves the hidden subgroup problem on the dihedral group by coset sampling. Additionally, we present an approach to solving the hidden subgroup problem on the dihedral...
متن کاملOn continuous variable quantum algorithms for oracle identification problems
We establish a framework for oracle identification problems in the continuous variable setting, where the stated problem necessarily is the same as in the discrete variable case, and continuous variables are manifested through a continuous representation in an infinite-dimensional Hilbert space. We apply this formalism to the Deutsch-Jozsa problem and show that, due to an uncertainty relation b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information Processing
سال: 2012
ISSN: 1570-0755,1573-1332
DOI: 10.1007/s11128-012-0489-1